On Some Decompositions of r-Disjunctive Languages
نویسنده
چکیده
Some kinds of decompositions of r-disjunctive languages on an arbitrary alphabet will be investigated. We will show that an f-disjunctive (t-disjunctive) language can be divided into two parts and either one part of them is an f-disjunctive (t-disjunctive) language or both parts are r-disjunctive but not f-disjunctive (t-disjunctive) languages. Finally, a relevant result of H. J. Shyr and S. S. Yu concerning the disjunctive languages will be improved. 2010 Mathematics Subject Classification: 20M35
منابع مشابه
Finding complex disjunctive decompositions of logic functions
This paper extends the previous work [1] on simple disjunctive decompositions to the important case of complex disjunctive decompositions. We pinpoint the sources of additional complexity of handling this decomposition style, and relate it to the existence of encoding don’t care conditions [2]. We define two classes of complex decompositions, almostand perfect decompositions, respectively. For ...
متن کاملSolving System of Linear Congruence Equations over some Rings by Decompositions of Modules
In this paper, we deal with solving systems of linear congruences over commutative CF-rings. More precisely, let R be a CF-ring (every finitely generated direct sum of cyclic R-modules has a canonical form) and let I_1,..., I_n be n ideals of R. We introduce congruence matrices theory techniques and exploit its application to solve the above system. Further, we investigate the application of co...
متن کاملFAST: FPGA Targeted RTL Structure Synthesis Technique
In this paper we present an approach for mapping RTL structures onto FPGAs. This is in contrast to other FPGA mapping techniques which start from boolean networks. Each component part consists of single-hit or multi-bit slice of one or more closely connected RTL components and are realized using one or more CLBs. For Otis mapping onto CLBs, primarily function decomposition is employed. Conditio...
متن کاملAn Algorithm for the Disjunctive Decomposition of Switching Functions
An algorithm for obtaining all simple disjunctive decompositions of a switching function is described. The algorithm proceeds by testing for all decompositions with a bound set of size two. Under given conditions, this test for a pair of variables will show that some larger bound sets, containing the two variables for which the test was conducted, cannot yield a decomposition. The remaining bou...
متن کاملThe Disjunctivities of w-languages
An ω-language over a finite alphabet X is a set of infinite sequences of letters of X. Consider congruences IL and Pω, L on X* and a congruence OL on X introduced by an ω-language L. IL, Pω, L, and OL are called the infinitary syntactic-congruence, the principal congruence and the ω-syntactic congruence of L, respectively. If IL (Pω, L, OL) is the equality then L is called an I-disjunctive (P-d...
متن کامل